On Deadlock and Fairness Decision Problems for Computations on Client-server Systems

A new formalism of Resource Driven Automata Nets (RDA-nets) is presented. A RDA-net has two levels: a system level is represented by a net of active resources, describing distribution of agents/resources and their interactions; agents in an object level are finite automata, communicating via ports and shared resources of a system level. RDA-nets are assigned for modeling mobility in multi-agent systems from the resource dependence perspective. We prove that RDA-nets have the same expressive power as Petri nets and give examples of modeling agent communications, dynamics and mobility.